General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
نویسندگان
چکیده
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the ciphertext of a message. It is constructed using bi-linear pairings. Its security is based on the intractability of the computational bilinear Diffie-Hellman problem. The scheme possesses chosen-plaintext security in the random oracle model.
منابع مشابه
Another Method for Attaining Security
Practical approaches to constructing public key cryptosystems secure against chosen ciphertext attacks were rst initiated by Damgard and further extended by Zheng and Seberry. In this paper we rst point out that in some cryptosystems proposed by Zheng and Seberry the method for adding authentication capability may fail just under known plaintext attacks. Next, we present a new method for immuni...
متن کاملTwo Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes, among others, the Paillier cryptosystem, and then, another scheme, built from a deterministic trapdoor function. Both schemes are proved semantically secure against chosen plaintext attacks in the standard security m...
متن کاملSecurity analysis of image cryptosystems only or partially based on a chaotic permutation
The paper proposes breaks for the permutation methods adopted in the chaos-based image cryptosystems. By a careful examination on the most chaotic image cryptosystems we can find that the permutation process constitute the main step or, in some cases, the only step to create the confusion. It can be applied on the pixels or on the pixel bits. A recently proposed image encryption scheme based on...
متن کاملChosen-Ciphertext Security of Multiple Encryption
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect against partial key exposure or cryptanalysis, or to enforce threshold access to data. Most prior work on this subject has focused on the security of multiple encryption against chosen-plaintext attacks, and has shown con...
متن کاملEfficient and Non-Malleable Proofs of Plaintext
We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols: – Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 6 شماره
صفحات -
تاریخ انتشار 2008